Description Logics over Lattices

نویسنده

  • Umberto Straccia
چکیده

In the last decade a substantial amount of work has been carried out in the context of Description Logics (DLs). DLs are a logical reconstruction of the so-called framebased knowledge representation languages, with the aim of providing a simple wellestablished Tarski-style declarative semantics to capture the meaning of the most popular features of structured representation of knowledge. A main point is that DLs are considered as to be attractive logics in knowledge based applications as they are a good compromise between expressive power and computational complexity. Despite their growing popularity, relatively little work has been carried out in extending them to the management of uncertain and imprecise information. This is a well-known and important issue whenever the real world information to be represented is of imperfect nature. In DLs, the problem has attracted the attention of some researchers and some frameworks have been proposed, which differ in the underlying notion of uncertainty and imprecision: e.g. probability theory, possibility theory, metric spaces, many-valued and fuzzy theory. In this paper we extend DLs allowing to express that a sentence is not just true or false like in classical DLs, but certain to some degree, which is taken from a certainty lattice. The certainty degree dictates to what extend (how certain it is that) a sentence is true. The adopted approach is more general than the fuzzy logic

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consistency in Fuzzy Description Logics over Residuated De Morgan Lattices

Fuzzy description logics can be used to model vague knowledge in application domains. This paper analyses the consistency and satisfiability problems in the description logic SHI with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of SHI...

متن کامل

The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals

The complexity of reasoning in fuzzy description logics (DLs) over finite lattices usually does not exceed that of the underlying classical DLs. This has recently been shown for the logics between L-IALC and L-ISCHI using a combination of automataand tableau-based techniques. In this report, this approach is modified to deal with nominals and constants in L-ISCHOI. Reasoning w.r.t. general TBox...

متن کامل

Towards Description Logic on Concept Lattices

In this position paper we start with a motivation of our study of modal/description logics with values in concept lattices. Then we give a brief survey of approaches to lattice-valued modal and/or description logics. After that we study some methods of context symmetrization, because the description logic on concept lattices is defined for symmetric co ntexts only. We conclude with a list of pr...

متن کامل

A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Lattices

Fuzzy description logics can be used to model vague knowledge in application domains. This paper analyses the consistency and satisfiability problems in the description logic SHI with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of SHI...

متن کامل

Consistency reasoning in lattice-based fuzzy Description Logics

Fuzzy Description Logics have been widely studied as a formalism for representing and reasoning withvague knowledge. One of the most basic reasoning tasks in (fuzzy) Description Logics is to decide whetheran ontology representing a knowledge domain is consistent. Surprisingly, not much is known about thecomplexity of this problem for semantics based on complete De Morgan lattices. T...

متن کامل

EQ-logics with delta connective

In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2006